Joint Distributions for Movements of Elements in Sattolo’s and the Fisher-yates Algorithm
نویسندگان
چکیده
Abstract. Sattolo’s algorithm creates a random cyclic permutation by interchanging pairs of elements in an appropriate manner; the Fisher-Yates algorithm produces random (not necessarily cyclic) permutations in a very similar way. The distributions of the movements of the elements in these two algorithms have already been treated quite extensively in past works. In this paper, we are interested in the joint distribution of two elements j and k; we are able to compute the bivariate generating functions explicitly, although it is quite involved. From it, moments and limiting distributions can be deduced. Furthermore, we compute the probability that elements i and j ever change places in both algorithms.
منابع مشابه
Probability generating functions for Sattolo’s algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables. The present article, starting from the de...
متن کاملOn Bivariate Generalized Exponential-Power Series Class of Distributions
In this paper, we introduce a new class of bivariate distributions by compounding the bivariate generalized exponential and power-series distributions. This new class contains the bivariate generalized exponential-Poisson, bivariate generalized exponential-logarithmic, bivariate generalized exponential-binomial and bivariate generalized exponential-negative binomial distributions as specia...
متن کاملNovel Architecture for Data – Shuffling Using Fisher Yates Shuffle Algorithm
Securing information from obtrudes is the miscellaneous process in communication, cryptography is an effective manner of securing the information. New architecture is designed in this paper based on Fisher Yates Shuffle algorithm to maintain secrecy of data. A newly modified magic rectangle (NMMR) is constructed based few constrains, like sum of row and column values are equal. The numerical va...
متن کاملFisher GAN
Generative Adversarial Networks (GANs) are powerful models for learning complex distributions. Stable training of GANs has been addressed in many recent works which explore different metrics between distributions. In this paper we introduce Fisher GAN which fits within the Integral Probability Metrics (IPM) framework for training GANs. Fisher GAN defines a critic with a data dependent constrain...
متن کاملNoncentral Generalized F Distributions with Applications to Joint Outlier Detection
An algorithm for computing the noncentral generalized F distribution is discussed. This distribution is required to compute the power of tests of multiple outliers in linear models based on shifts of location and scale. Applications to joint outlier detection are given. 1 Special Distributions Designate by L(Y ) the distribution of Y ∈ <, and by pdf and cdf its probability density and cumulativ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007